Use Cases for Triple Stores and Graph Databases in Scalable Data Infrastructures
نویسنده
چکیده
Various types of NoSQL databases may present a sound alternative to relational databases in eInfrastructures that require managing and analysing data supplied from disparate sources. This work considers a few use cases where particular types of NoSQL databases – triple stores and graph databases – may be a natural choice for scalable data services. The purpose of this work is to brief on the experiments performed and to provide a roadmap for further technology evaluation. Cases suggested are mapped to EUDAT common services [11] yet should be of interest to other eInfrastructures.
منابع مشابه
On-disk storage techniques for Semantic Web data - Are B-Trees always the optimal solution?
Since its introduction in 1971, the B-tree has become the dominant index structure in database systems. Conventional wisdom dictated that the use of a B-tree index or one of its descendants would typically lead to good results. The advent of XML-data, column stores, and the recent resurgence of typed-graph (or triple) stores motivated by the Semantic Web has changed the nature of the data typic...
متن کاملEmrooz: A Scalable Database for SSN Observations
The design of ontologies for sensor data and metadata has received considerable attention. The most prominent is arguably the Semantic Sensor Network (SSN) ontology. For persistence and retrieval of sensor observations, systems that adopt the SSN ontology most obviously build on an RDF database (triple store). However, large volumes of collected sensor data can be challenging for RDF databases,...
متن کاملTripleRush: A Fast and Scalable Triple Store
TripleRush is a parallel in-memory triple store designed to address the need for efficient graph stores that quickly answer queries over large-scale graph data. To that end it leverages a novel, graph-based architecture. Specifically, TripleRush is built on our parallel and distributed graph processing framework Signal/Collect. The index structure is represented as a graph where each index vert...
متن کاملTowards a Use Case Driven Evaluation of Database Systems for RDF Data Storage - A Case Study for Statistical Data
To store Linked Data one may choose from a growing number of available database systems: from traditional relational databases to RDF triple stores, not to mention the area of NoSQL technologies. Comparisons of database systems often use benchmarks to evaluate systems with the best overall runtime performance. However, the structure of data and queries used in traditional benchmarks differ from...
متن کاملRDF Triple Stores and a Custom SPARQL Front-End for Indexing and Searching (Very) Large Semantic Networks
With growing interest in the creation and search of linguistic annotations that form general graphs (in contrast to formally simpler, rooted trees), there also is an increased need for infrastructures that support the exploration of such representations, for example logical-form meaning representations or semantic dependency graphs. In this work, we lean heavily on semantic technologies and in ...
متن کامل